Elastoplastic Torsion by Quadratic Programming
نویسندگان
چکیده
A fItrite element scheme (together with a conjugate gradient algorithmj is demonstrated to be a very effective method for analyzing general elastoplastic torsion of prismatic bars posed as quadratic programming problems. Solutions for bars with elliptical and Sokolovsky’s oval cross-sections are presented. The solutions for the elliptical bars agree with the existing elastic and limit plastic solutions at the two extremes of the elastic-plastic range. The algorithm also reproduces accurately the Sokolovsky solution and extends it beyond its limitations.
منابع مشابه
Elastoplastic torsion of hollow FGM circular shaft
In many cases, a torsional shaft may be a thick-walled radially inhomogeneous cylindrical object. The hollow shafts made of functionally graded materials (FGMs) are such kind of compositions which were studied in this paper. Cylindrical FG shafts are composed of ceramic and metallic parts with power function distribution across the radial direction. The ceramic phase is isotropic elastic and th...
متن کاملFGP approach to multi objective quadratic fractional programming problem
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملQuadratic bi-level programming problems: a fuzzy goal programming approach
This paper presents a fuzzy goal programming (FGP) methodology for solving bi-level quadratic programming (BLQP) problems. In the FGP model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...
متن کامل